Hybrid Biogeography-Based Optimization for Integer Programming
نویسندگان
چکیده
منابع مشابه
Hybrid Biogeography-Based Optimization for Integer Programming
Biogeography-based optimization (BBO) is a relatively new bioinspired heuristic for global optimization based on the mathematical models of biogeography. By investigating the applicability and performance of BBO for integer programming, we find that the original BBO algorithm does not perform well on a set of benchmark integer programming problems. Thus we modify the mutation operator and/or th...
متن کاملParticipative Biogeography-Based Optimization
Biogeography-Based Optimization (BBO) has recently gained interest of researchers due to its simplicity in implementation, efficiency and existence of very few parameters. The BBO algorithm is a new type of optimization technique based on biogeography concept. This population-based algorithm uses the idea of the migration strategy of animals or other species for solving optimization problems. t...
متن کاملBiogeography-Based Optimization Algorithm for Automatic Extractive Text Summarization
Given the increasing number of documents, sites, online sources, and the users’ desire to quickly access information, automatic textual summarization has caught the attention of many researchers in this field. Researchers have presented different methods for text summarization as well as a useful summary of those texts including relevant document sentences. This study select...
متن کاملSize optimization for hybrid photovoltaic-wind energy system using ant colony optimization for continuous domains based integer programming
In this paper, ant colony optimization for continuous domains (ACOR) based integer programming is employed for size optimization in a hybrid photovoltaic (PV)–wind energy system. ACOR is a direct extension of ant colony optimization (ACO). Also, it is the significant ant-based algorithm for continuous optimization. In this setting, the variables are first considered as real then rounded in each...
متن کاملHybrid Enumeration Strategies for Mixed Integer Programming
In this paper we present several algorithms which combine a partial enumeration with meta-heuristics for the solution of general mixed-integer programming problems. The enumeration is based on the primal values assignable to the integer variables of the problem. We develop some algorithms for this integration, and test them using a set of well-known benchmark problems. Key-words: Enumeration, L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Scientific World Journal
سال: 2014
ISSN: 2356-6140,1537-744X
DOI: 10.1155/2014/672983